An algorithm for producing median formulas for Boolean functions
نویسندگان
چکیده
We review various normal form representations of Boolean functions and outline a comparative study between them, which shows that the median normal form system provides representations that are more efficient than the classical DNF, CNF and Reed–Muller (polynomial) normal form representations. We present an algorithm for producing median normal form representations of Boolean functions.
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملRead - Once Threshold Formulas , Justifying Assignments , and Generic
We present a membership query (i.e. interpolation) algorithm for exactly identifying the class of read-once formulas over the basis of boolean threshold functions. Using a generic transformation from Angluin, Hellerstein, Karpin-ski 89], this gives an algorithm using membership and equivalence queries for exactly identifying the class of read-once formulas over the basis of boolean threshold fu...
متن کاملSatisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
We give a #SAT algorithm for boolean formulas over arbitrary finite bases. Let Bk be the basis composed of all boolean functions on at most k inputs. For Bk-formulas on n inputs of size cn, our algorithm runs in time 2n(1−δc,k) for δc,k = c −O(c2k2k). We also show the average-case hardness of computing affine extractors using linear-size Bk-formulas. We also give improved algorithms and lower b...
متن کاملAn algorithm for 3-SAT problems
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and the sums of the formulas are calculated. The algorithm outputs the number of satisfying assignments. The computational complexity of the algorithm is probab...
متن کاملNonlinearity of quartic rotation symmetric Boolean functions
Nonlinearity of rotation symmetric Boolean functions is an important topic on cryptography algorithm. Let e ≥ 1 be any given integer. In this paper, we investigate the following question: Is the nonlinearity of the quartic rotation symmetric Boolean function generated by the monomial x0xex2ex3e equal to its weight? We introduce some new simple sub-functions and develop new technique to get seve...
متن کامل